Characterisations of intersection graphs by vertex orderings
نویسنده
چکیده
Characterisations of interval graphs, comparability graphs, co-comparability graphs, permutation graphs, and split graphs in terms of linear orderings of the vertex set are presented. As an application, it is proved that interval graphs, cocomparability graphs, AT-free graphs, and split graphs have bandwidth bounded by their maximum degree.
منابع مشابه
Computing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملOn vertex orderings and the stability number in triangle-free graphs
Given an ordering of the vertices of a graph one can construct a maximal stable set of that graph applying a simple greedy algorithm. By investigating certain conditions on the orderings of the vertices, N.V.R. Mahadev and B.A. Reed [5] characterized a class of graphs for which a maximum stable set and hence also the stability number can be computed in polynomial time in this way. In this paper...
متن کاملA characterization of signed graphs with generalized perfect elimination orderings
An important property of chordal graphs is that these graphs are characterized by existence of perfect elimination orderings on their vertex sets. In this paper, we generalize the notion of perfect elimination orderings to signed graphs, and give a characterization for graphs admitting such orderings, together with characterizations restricted to some subclasses and further properties of those ...
متن کاملA Characterization of Edge-Bicolored Graphs with Generalized Perfect Elimination Orderings
An important property of chordal graphs is that these graphs are characterized by existence of perfect elimination orderings on their vertex sets. In this paper, we generalize the notion of perfect elimination orderings to graphs with edge-colorings by two colors, and give an excluded-subgraph characterization for graphs with such orderings. As an application, we announce some forthcoming resul...
متن کاملPerfect elimination orderings for symmetric matrices
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of monotone families of chordal graphs, Robinsonian matrices and ultrametrics. We give a structural characterization for matrices that admit perfect elimination o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 34 شماره
صفحات -
تاریخ انتشار 2006